Complete graph - PDFSEARCH.IO - Document Search Engine

Complete graph
Results: 868

#	Item
691	A Hamilton Path Heuristic with Applications to the Middle Two Levels Problem Ian Shields IBM P.O. Box[removed]Research Triangle Park, North Carolina 27709, USA Add to Reading List Source URL: www.cybershields.com Language: English - Date: 2006-06-01 22:54:49 NP-complete problems Graph Hamiltonian path Connectivity Symbol Covering graph Graph theory Mathematics Theoretical computer science
692	Partitioning the Internet Matthias Wachs TU M¨unchen [removed] Add to Reading List Source URL: grothoff.org Language: English - Date: 2012-08-27 15:10:51 NP-complete problems Search algorithms Graph partition Graph Breadth-first search Topology Planar separator theorem Chordal graph Graph theory Mathematics Theoretical computer science
693	Perfect Graphs, Partitionable Graphs and Cutsets Michele Conforti Gerard Cornuejols y Grigor Gasparyan z and Kristina Vuskovic x Add to Reading List Source URL: integer.tepper.cmu.edu Language: English - Date: 2000-09-19 18:20:11 Line graph Clique Perfect graph Bipartite graph Matching NP-complete problems Combinatorial optimization Tree decomposition Graph structure theorem Graph theory Graph operations Chordal graph
694	On Algorithmic Complexity of Biomolecular Sequence Assembly Problem Giuseppe Narzisi1 , Bud Mishra1,2 , and Michael C Schatz1 1 Simons Center for Quantitative Biology, One Bungtown Road, Cold Spring Harbor Add to Reading List Source URL: cs.nyu.edu Language: English - Date: 2014-03-31 07:45:24 Travelling salesman problem Eulerian path Graph Path Network theory Line graph Coxeter graph Graph theory NP-complete problems Graph connectivity
695	Hyperplane Annealing and Activator-Inhibitor-Systems Add to Reading List Source URL: tlausser.com Language: English - Date: 2001-11-28 19:57:18 NP-complete problems Operations research Mathematical optimization Simulated annealing Relaxation Combinatorial optimization Travelling salesman problem Graph coloring Annealing Theoretical computer science Mathematics Applied mathematics
696	On an optimal randomized acceptor for graph nonisomorphism∗ Edward A. Hirsch†,‡ Dmitry Itsykson† November 9, 2011 Add to Reading List Source URL: logic.pdmi.ras.ru Language: English - Date: 2011-11-09 06:46:56 Analysis of algorithms Mathematical optimization Complexity classes Graph coloring NP-complete Randomized algorithm P versus NP problem NP Time complexity Theoretical computer science Computational complexity theory Applied mathematics
697	A new trust region technique for the maximum weight clique problem Stanislav Busygin Industrial and Systems Engineering Department, University of Florida, 303 Weil Hall, Gainesville, FL 32611, USA Add to Reading List Source URL: www.stasbusygin.org Language: English - Date: 2009-02-11 00:35:51 NP-complete problems Clique Independent set Maximal independent set Tree decomposition Path decomposition Graph theory Theoretical computer science Mathematics
698	A Simple Clique Camouflaging Against Greedy Maximum Clique Heuristics ∗ Stanislav Busygin [removed] http://www.stasbusygin.org Add to Reading List Source URL: www.stasbusygin.org Language: English - Date: 2009-02-11 00:35:51 Graph operations Graph coloring Clique problem Clique Independent set Neighbourhood Degree Path decomposition Maximal independent set Graph theory Theoretical computer science NP-complete problems
699	A Least Squares Framework for the Maximum Weight Clique Problem ∗ Stanislav Busygin [removed] http://www.stasbusygin.org October 14, 2007, updated: May 29, 2010 Add to Reading List Source URL: www.stasbusygin.org Language: English - Date: 2010-05-30 08:45:57 NP-complete problems Graph operations Clique problem Clique Line graph Graph coloring Eigenvalues and eigenvectors Graph theory Mathematics Theoretical computer science
700	Computing the maximum clique in visibility graphs Add to Reading List Source URL: www.tcs.tifr.res.in Language: English - Date: 2010-03-10 01:30:36 Robot control Visibility graph Hamiltonian path Art gallery problem Graph Visibility Clique Independent set Line graph Graph theory NP-complete problems Graph operations

UPDATE